Single Approximation for Biobjective Max TSP
نویسندگان
چکیده
We mainly study Max TSP with two objective functions. We propose an algorithm which returns a single Hamiltonian cycle with performance guarantee on both objectives. The algorithm is analysed in three cases. When both (resp. at least one) objective function(s) fulfill(s) the triangle inequality, the approximation ratio is 5 12 − ε ≈ 0.41 (resp. 3 8 − ε). When the triangle inequality is not assumed on any objective function, the algorithm is 1+2 √ 2 14 − ε ≈ 0.27-approximate.
منابع مشابه
Approximation with a Fixed Number of Solutions of Some Biobjective Maximization Problems
We investigate the problem of approximating the Pareto set of biobjective optimization problems with a given number of solutions. This task is relevant for two reasons: (i) Pareto sets are often computationally hard so approximation is a necessary tradeoff to allow polynomial time algorithms; (ii) limiting explicitly the size of the approximation allows the decision maker to control the expecte...
متن کاملApproximation with a fixed number of solutions of some multiobjective maximization problems
We investigate the problem of approximating the Pareto set of biobjective optimization problems with a given number of solutions. This task is relevant for two reasons: (i) Pareto sets are often computationally hard so approximation is a necessary tradeoff to allow polynomial time algorithms; (ii) limiting explicitly the size of the approximation allows the decision maker to control the expecte...
متن کاملA On Approximating Multi-Criteria TSP
We present approximation algorithms for almost all variants of the multi-criteria traveling salesman problem (TSP). First, we devise randomized approximation algorithms for multi-criteria maximum traveling salesman problems (Max-TSP). For multi-criteria Max-STSP, where the edge weights have to be symmetric, we devise an algorithm with an approximation ratio of 2/3 − ε. For multi-criteria Max-AT...
متن کاملApproximating Multi-criteria Max-TSP
The traveling salesman problem (TSP) is one of the most fundamental problems in combinatorial optimization. Given a graph, the goal is to find a Hamiltonian cycle of minimum or maximum weight. We consider finding Hamiltonian cycles of maximum weight (Max-TSP). An instance of Max-TSP is a complete graph G = (V,E) with edge weights w : E → N. The goal is to find a Hamiltonian cycle of maximum wei...
متن کاملMulti-Criteria TSP: Min and Max Combined
We present randomized approximation algorithms for multicriteria traveling salesman problems (TSP), where some objective functions should be minimized while others should be maximized. For the symmetric multi-criteria TSP (STSP), we present an algorithm that computes (2/3−ε, 4+ε) approximate Pareto curves. Here, the first parameter is the approximation ratio for the objectives that should be ma...
متن کامل